Scalable $M$-Channel Critically Sampled Filter Banks for Graph Signals

Critically Sampled Third Octave Filter Banks

the complexity of splitting a single fullrate signal into third octave sections. The complexity of a single PQMF cosine modulated lter bank (analysis or synthesis), C QMF (M; N) is on the order of N+MlogM M , where N is the length of the lowpass prototype lter and M is the number of channels in the lter bank. The M in the denominator is because of the dec-imation by M, N is the cost of FIR conv...

Subband Blind Source Separation with Critically Sampled Filter Banks

Subband blind source separation methods have been recently proposed with the objective of reducing the computational complexity and improving the convergence rate of online adaptive algorithms. Oversampled subband structures, employing uniform DFT filter banks, are usually employed in order to avoid aliasing effects and keep enough samples to estimate the statistics of the subband signals. In t...

On Fa torization of M-Channel Paraunitary Filter Banks

Complex modulated critically sampled filter banks based on cosine and sine modulation

This paper explores subband processing of complex (I/Q) signals which finds various important applications especially in communications signal processing. Instead of using traditional DFT based systems, the filter bank based systems are very interesting choices when high selectivity in the subchannels is required. We present a novel efficient complex modulated critically sampled filter bank str...

Nonsubsampled Graph Filter Banks and Distributed Implementation

In this paper, we consider nonsubsampled graph filter banks (NSGFBs) to process data on a graph in a distributed manner. Given an analysis filter bank with small bandwidth, we propose algebraic and optimization methods of constructing synthesis filter banks such that the corresponding NSGFBs provide a perfect signal reconstruction in the noiseless setting. Moreover, we prove that the proposed N...